On the Sound Covering Cycle Problem in Paired de Bruijn Graphs
نویسندگان
چکیده
Paired de Bruijn graphs are a variant of classic de Bruijn graphs used in genome assembly. In these graphs, each vertex v is associated with two labels L(v) and R(v). We study the NP-hard Sound Covering Cycle problem which has as input a paired de Bruijn graph G and two integers d and `, and the task is to find a length-` cycle C containing all arcs of G such that for every vertex v in C and the vertex u which occurs exactly d positions after v in C, we have R(v) = L(u). We present the first exact algorithms for this problem and several variants.
منابع مشابه
On NP-Hardness of the Paired de Bruijn Sound Cycle Problem
The paired de Bruijn graph is an extension of de Bruijn graph incorporating mate pair information for genome assembly proposed by Mevdedev et al. However, unlike in an ordinary de Bruijn graph, not every path or cycle in a paired de Bruijn graph will spell a string, because there is an additional soundness constraint on the path. In this paper we show that the problem of checking if there is a ...
متن کاملDe Bruijn Covering Codes for Rooted Hypergraphs
What is the length of the shortest sequence S of reals so that the set of consecutive n-words in S form a covering code for permutations on {1, 2, . . . , n} of radius R ? (The distance between two n-words is the number of transpositions needed to have the same order type.) The above problem can be viewed as a special case of finding a De Bruijn covering code for a rooted hypergraph. Each edge ...
متن کاملCoverings, matchings and paired domination in fuzzy graphs using strong arcs
The concepts of covering and matching in fuzzy graphs using strong arcs are introduced and obtained the relationship between them analogous to Gallai’s results in graphs. The notion of paired domination in fuzzy graphs using strong arcs is also studied. The strong paired domination number γspr of complete fuzzy graph and complete bipartite fuzzy graph is determined and obtained bounds for the s...
متن کاملColouring of cycles in the de bruijn graphs
We show that the problem of finding the family of all so called the locally reducible factors in the binary de Bruijn graph of order k is equivalent to the problem of finding all colourings of edges in the binary de Bruijn graph of order k − 1, where each vertex belongs to exactly two cycles of different colours. In this paper we define and study such colouring for the greater class of the de B...
متن کاملApproximating the Shortest Superstring Problem Using de Bruijn Graphs
The best known approximation ratio for the shortest superstring problem is 2 11 23 (Mucha, 2012). In this note, we improve this bound for the case when the length of all input strings is equal to r, for r ≤ 7. For example, for strings of length 3 we get a 1 1 3 -approximation. An advantage of the algorithm is that it is extremely simple both to implement and to analyze. Another advantage is tha...
متن کامل